AIDA: A Bandwidth Allocation Strategy for Distributed Real-Time Systems

In this paper, we propose a superior technique for distributed time-critical communication using AIDA, a novel elaboration on Michael O. Rabin's IDA 19]. We show that using a small dynamically-controlled amount of redundancy, stringent timing constraints imposed on periodic as well as sporadic communication requests in a distributed real-time system can be fulllled up to any degree of conndence. AIDA is randomized in the sense that it does not guarantee the fullllment of hard time constraints. Instead, it guarantees a lower bound on the probability of fulllling such constraints. We contrast AIDA with traditional communication scheduling techniques used in conjunction with time-critical applications in general, and distributed multimedia systems in particular. The suitability of AIDA-based bandwidth allocation for a variety of time-critical applications is established and plans for future research experiments are mentioned.